Unified Arbitrary Rectilinear Block Packing and Soft Block Packing Based on Sequence Pair
نویسندگان
چکیده
To the best of our knowledge, this is the first algorithm unifying arbitrary rectilinear block packing and soft block packing. Furthermore, this algorithm handles arbitrary convex or concave rectilinear block packing in the most efficient way compared to other sequence pair-based approaches. At the same time, the algorithm can handle rectangle soft block effectively. The concept of non-redundant constraint graph together with its algorithms play critical role in unifying the arbitrary rectilinear block packing and soft block packing. This general block packing tool builds the foundation for floorplanning with IP reuse. The experimental results demonstrate the efficiency and effectiveness of this general block packing.
منابع مشابه
On extending slicing floorplans to handle L/T-shaped modules and abutment constraints
In oorplanning it is common that a designer wants to have certain modules abutting with one another in the nal pack ing Unfortunately few oorplanning algorithm can han dle abutment constraints although this feature is useful in practice The problem of controlling the relative positions of an arbitrary number of modules is non trivial Slicing oorplans have an advantageous feature that the topolo...
متن کاملA Partition-based Heuristic Algorithm for the Rectilinear Block Packing Problem
This paper focuses on a two-dimensional strip packing problem where a set of arbitrarily shaped rectilinear blocks need be packed into a larger rectangular container without overlap. A rectilinear block is a polygonal block whose interior angles are either 90◦or 270◦. This problem involves many industrial applications, such as VLSI design, timber/glass cutting, and newspaper layout. We generali...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملModule Placement on BSG-Structure with Pre-Placed Modules and Rectilinear Modules
A main task in designing IC/PCB is to pack rectilinear modules under various constraints and objectives. If modules are all rectangles without any positional constraint, recently proposed BSG and Sequence-pair based packing algorithms have been proved to work fast enough for practical use. Focusing BSG, to support an e ective use, this paper develops techniques to handle rectilinear modules and...
متن کاملArbitrary Convex and Concave Rectilinear Module Packing Using the Transitive Closure Graph Representation
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are transparent to TCG as well as its induced operations, which makes TCG an ideal representation for floorplanning/placement with arbitrary rectilinear modules. We first partition a rectilinear module into a set of submod...
متن کامل